The Pfaffian Transform
نویسندگان
چکیده
We introduce a function on sequences, which we call the Pfaffian transform, using the Pfaffian of a skew-symmetric matrix. We establish several basic properties of the Pfaffian transform, and we use the transfer matrix method to show that the set of sequences with rational generating functions is closed under the Pfaffian transform. We conclude by computing the Pfaffian transform of a variety of sequences, including geometric sequences, the sequence of Fibonacci numbers, the sequence of Pell numbers, the sequence of Jacobsthal numbers, and the sequence of Tribonacci numbers. Throughout we describe a generalization of our results to Pfaffians of skew-symmetric matrices whose entries satisfy a Pascal-like relation.
منابع مشابه
0 Extended Goursat Normal Forms with Applications to Nonholonomic Motion Planning
The theme of this paper is the generalization of Goursat normal forms for Pfaffian systems with co-dimension greater than two. There are necessary and sufficient conditions for the existence of coordinates that transform a Pfaffian system with co-dimension greater than two into an extended Goursat normal form, which is the dual of the multiple-chain, single-generator chained form mentioned in o...
متن کاملMatching signatures and Pfaffian graphs
We prove that every 4-Pfaffian that is not Pfaffian essentially has a unique signature matrix. We also give a simple composition Theorem of 2r-Pfaffian graphs from r Pfaffian spanning subgraphs. We apply these results and exhibit a graph that is 6-Pfaffian but not 4-Pfaffian. This is a counter-example to a conjecture of Norine [5], which states that if a graph G is k-Pfaffian but not (k − 1)-Pf...
متن کاملα-Pfaffian, pfaffian point process and shifted Schur measure
For any complex number α and any even-size skew-symmetric matrix B, we define a generalization pf α (B) of the pfaffian pf(B) which we call the α-pfaffian. The α-pfaffian is a pfaffian analogue of the α-determinant studied in [ST] and [V]. It gives the pfaffian at α = −1. We give some formulas for α-pfaffians and study the positivity. Further we define point processes determined by the α-pfaffi...
متن کاملCombinatorics of Tripartite Boundary Connections for Trees and Dimers
A grove is a spanning forest of a planar graph in which every component tree contains at least one of a special subset of vertices on the outer face called nodes. For the natural probability measure on groves, we compute various connection probabilities for the nodes in a random grove. In particular, for “tripartite” pairings of the nodes, the probability can be computed as a Pfaffian in the en...
متن کاملFrontier and Closure of a Semi-Pfaffian Set
For a semi-Pfaffian set, i.e., a real semianalytic set defined by equations and inequalities between Pfaffian functions in an open domain G, the frontier and closure in G are represented as semi-Pfaffian sets. The complexity of this representation is estimated in terms of the complexity of the original set. Introduction. Pfaffian functions introduced by Khovanskii [K] are analytic functions sat...
متن کامل